By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
Volume 11, Issue 1, pp. 1-181

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Ring Loading Problem

Alexander Schrijver, Paul Seymour, and Peter Winkler

pp. 1-14

Interference-Minimizing Colorings of Regular Graphs

P. C. Fishburn, J. H. Kim, J. C. Lagarias, and P. E. Wright

pp. 15-40

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

D. R. Stinson and R. Wei

pp. 41-53

The Number of Independent Sets in a Grid Graph

Neil J. Calkin and Herbert S. Wilf

pp. 54-60

A Randomness-Rounds Tradeoff in Private Computation

Eyal Kushilevitz and Adi Rosén

pp. 61-80

Sometimes Travelling is Easy: The Master Tour Problem

Vladimir G. Deuineko, Rüdiger Rudolf, and Gerhard J. Woeginger

pp. 81-93

Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

Andrzej Proskurowski, Frank Ruskey, and Malcolm Smith

pp. 94-109

An Ordering on the Even Discrete Torus

Oliver Riordan

pp. 110-127

Competition Graphs of Hamiltonian Digraphs

David R. Guichard

pp. 128-134

The Number of Intersection Points Made by the Diagonals of a Regular Polygon

Bjorn Poonen and Michael Rubinstein

pp. 135-156

Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups

Charles M. Fiduccia, Rodney W. Forcade, and Jennifer S. Zito input epsf

pp. 157-167